On Approximating the d-Girth of a Graph
نویسندگان
چکیده
For a finite, simple, undirected graph G and an integer d ≥ 1, a mindeg-d subgraph is a subgraph of G of minimum degree at least d. The dgirth of G, denoted gd(G), is the minimum size of a mindeg-d subgraph of G. It is a natural generalization of the usual girth, which coincides with the 2-girth. The notion of d-girth was proposed by Erdős et al. [13, 14] and Bollobás and Brightwell [7] over 20 years ago, and studied from a purely combinatorial point of view. Since then, no new insights have appeared in the literature. Recently, first algorithmic studies of the problem have been carried out [2,4]. The current article further explores the complexity of finding a small mindeg-d subgraph of a given graph (that is, approximating its d-girth), by providing new hardness results and the first approximation algorithms in general graphs, as well as analyzing the case where G is planar.
منابع مشابه
The distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملOn the girth of the annihilating-ideal graph of a commutative ring
The annihilating-ideal graph of a commutative ring $R$ is denoted by $AG(R)$, whose vertices are all nonzero ideals of $R$ with nonzero annihilators and two distinct vertices $I$ and $J$ are adjacent if and only if $IJ=0$. In this article, we completely characterize rings $R$ when $gr(AG(R))neq 3$.
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 161 شماره
صفحات -
تاریخ انتشار 2011